Perturbation analysis of theGI/GI/1 queue
نویسندگان
چکیده
We examine a family of GI/GI/1 queueing processes generated by a parametric family of service time distributions, F (x, θ), and we show that under suitable conditions the corresponding customer stationary expectation of the system time is twice continuously differentiable with respect to θ. Expressions for the derivatives are given which are suitable for single run derivative estimation. These results are extended to parameters of the interarrival time distribution and expressions for the corresponding second derivatives (as well as partial second derivatives involving both interarrival and service time parameters) are also obtained. Finally we present perturbation analysis algorithms based on these expressions along with simulation results demonstrating their performance.
منابع مشابه
Mean Time for the Development of Largeworkloads and Large Queue Lengths in the Gi/g/1 Queue
We consider the GI/G/1 queue described by either the workload (unfinished work) or the number of customers in the system. We compute the mean time until reaches or exceeds the level , and also the mean time until reaches 0. For the M/G/1 and GI/M/1 models, we obtain exact contour integral representations for these mean first passage times. We then compute the mean times asymptotically, as and 0...
متن کاملConvergence of a Stochastic Approximation Algorithm for the GI/G/1 Queue Using Infinitesimal Perturbation Analysis
Discrete-event systems to which the technique of infinitesimal perturbation analysis (IPA) is applicable are natural candidates for optimization via a Robbins-Monro type stochastic approximation algorithm. We establish a simple framework for single-run optimization of systems with regenerative structure. The main idea is to convert the original problem into one in which unbiased estimators can ...
متن کاملError Bounds for Perturbing Nonexponential Queues
A general framework is provided to derive analytic error bounds for the effect of perturbations and inaccuracies of nonexponential service or arrival distributions in singleand multi-server queues. The general framework is worked out in detail for the three types of finite or infinite buffer queues: GI/G/1/N , M/G/c/N , and GI/M/c/N . First, for the standard GI/G/1/N queue, it is illustrated ho...
متن کاملCentral Limit Theorems for Stochastic Optimization Algorithms Using Infinitesimal Perturbation Analysis
Central limit theorems are obtained for the \perturbation analysis Robbins-Monro single run" (PARMSR) optimization algorithm, with updates either after every L customers or after every busy period, in the context of the optimization of a GI=GI=1 queue. The PARMSR algorithm is a stochastic approximation (SA) method for the optimization of innnite-horizon models. It is shown that the convergence ...
متن کاملA large-deviations analysis of the GI/GI/1 SRPT queue
We consider a GI/GI/1 queue with the shortest remaining processing time discipline (SRPT) and light-tailed service times. Our interest is focused on the tail behavior of the sojourn-time distribution. We obtain a general expression for its large-deviations decay rate. The value of this decay rate critically depends on whether there is mass in the endpoint of the service-time distribution or not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 18 شماره
صفحات -
تاریخ انتشار 1994